Improved Complexity Analysis for Cut Elimination and Herbrand’s Theorem (second corrected version)
نویسنده
چکیده
منابع مشابه
Refined Complexity Analysis of Cut Elimination
In [1, 2] Zhang shows how the complexity of cut elimination depends primarily on the nesting of quantifiers in cut formulas. By studying the role of contractions in cut elimination we can refine that analysis and show how the complexity depends on a combination of contractions and quantifier nesting. With the refined analysis the upper bound on cut elimination coincides with Statman’s lower bou...
متن کاملZach The Epsilon Calculus and Herbrand Complexity
Hilbert’s ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand’s Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon t...
متن کاملTechniques in weak analysis for conservation results
We review and describe the main techniques for setting up systems of weak analysis, i.e. formal systems of second-order arithmetic related to subexponential classes of computational complexity. These involve techniques of proof theory (e.g., Herbrand’s theorem and the cut-elimination theorem) and model theoretic techniques like forcing. The techniques are illustrated for the particular case of ...
متن کاملDescribing proofs by short tautologies
Herbrand’s theorem is one of the most fundamental results about first-order logic. In the context of proof analysis, Herbrand-disjunctions are used for describing the constructive content of cut-free proofs. However, given a proof with cuts, the computation of an Herbrand-disjunction is of significant computational complexity, as the cuts in the proof have to be eliminated first. In this paper ...
متن کاملG.Moser R.Zach The Epsilon Calculus and
Hilbert’s ε-calculus is based on an extension of the language of predicate logic by a term-forming operator εx. Two fundamental results about the ε-calculus, the first and second epsilon theorem, play a rôle similar to that which the cut-elimination theorem plays in sequent calculus. In particular, Herbrand’s Theorem is a consequence of the epsilon theorems. The paper investigates the epsilon t...
متن کامل